Efficient Modular NIZK Arguments from Shift and Product
نویسندگان
چکیده
We propose a non-interactive product argument, that is more efficient than the one by Groth and Lipmaa, and a novel shift argument. We then use them to design several novel non-interactive zero-knowledge (NIZK) arguments. We obtain the first range proof with constant communication and subquadratic prover’s computation. We construct NIZK arguments for NPcomplete languages, Set-Partition, Subset-Sum and Decision-Knapsack, with constant communication, subquadratic prover’s computation and linear verifier’s computation.
منابع مشابه
Efficient Short Adaptive NIZK for NP
In Eurocrypt 2013, Gennaro et al. proposed an efficient non-adaptive short QAP-based NIZK argument for Circuit-SAT, where non-adaptivity means that the CRS depends on the statement to be proven. While their argument can be made adaptive by using universal circuits, this increases the prover computation by a logarithmic multiplicative factor. By following the QAP-based approach, we propose an ef...
متن کاملNew Non-Interactive Zero-Knowledge Subset Sum, Decision Knapsack And Range Arguments
We propose several new efficient non-interactive zero knowledge (NIZK) arguments in the common reference string model. The final arguments are based on two building blocks, a more efficient version of Lipmaa’s Hadamard product argument from TCC 2012, and a novel shift argument. Based on these two arguments, we speed up the recent range argument by Chaabouni, Lipmaa and Zhang (FC 2012). We also ...
متن کاملSmooth NIZK Arguments with Applications to Asymmetric UC-PAKE and Threshold-IBE
We introduce a novel notion of smooth (-verifier) noninteractive zero-knowledge proofs (NIZK) which parallels the familiar notion of smooth projective hash functions (SPHF). We also show that the recent single group element quasi-adaptive NIZK (QA-NIZK) of Jutla and Roy (CRYPTO 2014) for linear subspaces can be easily extended to be computationally smooth. One important distinction of the new n...
متن کاملSmooth NIZK Arguments with Applications to Asymmetric UC-PAKE
We introduce a novel notion of smooth (-verifier) noninteractive zero-knowledge proofs (NIZK) which parallel the familiar notion of smooth projective hash functions (SPHF). We also show that the recent single group element quasi-adaptive NIZK (QA-NIZK) of Jutla and Roy (CRYPTO 2014) for linear subspaces can be easily extended to be computationally smooth. One important distinction of the new no...
متن کاملEfficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
One way to guarantee security against malicious voting servers is to use NIZK shuffle arguments. Up to now, only two NIZK shuffle arguments in the CRS model have been proposed. Both arguments are relatively inefficient compared to known random oracle based arguments. We propose a new, more efficient, shuffle argument in the CRS model. Importantly, its online prover’s computational complexity is...
متن کامل